G-GCS - A Geogrpahic Aware Graph Coupling Structure for GIS Water Flow Representation
نویسندگان
چکیده
A new computational representation for dealing with water flow in GIS applications is proposed. Different computer structures have been studied proposed and implemented and have gained a place in most of the commercial systems. Each particular local water flow data structure needs its own set of operators in order to provide support for Distributed Hydrologic Modeling. On this paper a new data structure based on Graph theory and preserving geographical awareness called G-GCS – Geographical Aware-Graph Coupling Structure (G-GCS) is presented. It is as a basis for a unified computer local water flow representation independent of the data structures used for representing the terrain topography.
منابع مشابه
Analysis of InGaAsP-InP Double Microring Resonator using Signal Flow Graph Method
The buried hetero-structure (BH) InGaAsP-InP waveguide is used for asystem of double microring resonators (DMR). The light transmission and location ofresonant peaks are determined for six different sets of ring radii with different ordermode numbers. The effect of changing middle coupling coefficient on the box likeresponse is studied. It is found that the surge of coupling coefficient to the ...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملDelayed Coupling to Feedback Inhibition during a Critical Period for the Integration of Adult-Born Granule Cells
Developing granule cells (GCs) of the adult dentate gyrus undergo a critical period of enhanced activity and synaptic plasticity before becoming mature. The impact of developing GCs on the activity of preexisting dentate circuits remains unknown. Here we combine optogenetics, acute slice electrophysiology, and in vivo chemogenetics to activate GCs at different stages of maturation to study the ...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کامل